General lower bounds forb→dpenguin processes

General Lower Bounds for Evolutionary Algorithms

@inProceedings{lbes, author={O. Teytaud and S. Gelly}, title={General lower bounds for evolutionary algorithms}, booktitle = {$10^{th}$ International Conference on Parallel Problem Solving from Nature (PPSN 2006), 10 pages,},

Some Lower Bounds for Estrada Index

General Sample Complexity lower bounds for Parametric Estimation

In the previous lecture, we introduced the notion of minimax error/risk, and looked at how it can be lower bounded by sample complexity for a well studied case: estimating the mean of a Gaussian distribution with known variance. In this lecture, we introduce techniques which work for more general parametric classes, using which the sample complexity lower bounds derived in the previous lecture ...

General Lower Bounds on Maximal Determinants of Binary Matrices

We prove general lower bounds on the maximal determinant of n× n {+1,−1}matrices, both with and without the assumption of the Hadamard conjecture. Our bounds improve on earlier results of de Launey and Levin (2010) and, for certain congruence classes of n mod 4, the results of Koukouvinos, Mitrouli and Seberry (2000). In an Appendix we give a new proof, using Jacobi’s determinant identity, of a...

New Lower Bounds for General Locally Decodable Codes

For any odd integer q > 1, we improve the lower bound for general q-query locally decodablecodes C : {0, 1}n → {0, 1}m from m = Ω(n/ logn)q+1q−1 to m = Ω( nq+1q−1) / logn. For example,for q = 3 we improve the previous bound from Ω(n/ log n) to Ω(n/ logn). For linear 3-querylocally decodable codes C : F → F, we improve the lower bound further to Ω(n/ log log n...